Real functions computable by finite automata using affine representations
نویسندگان
چکیده
منابع مشابه
Analytic Functions Computable by Finite State Transducers
We show that the only analytic functions computable by finite state transducers in sofic Möbius number systems are Möbius transformations.
متن کاملReal Functions computed by Parametric Weighted Finite Automata
Weighted finite automata (WFA) are an extension of finite automata that can be used to compute real functions and parametric WFA (PWFA) are a multidimensional variant of WFA. This paper shows that each PWFA computable set is computable by a PWFA that has an alphabet cardinality of two. Further we show that real polynomials with solely rational coefficients can be computed by PWFA that do not us...
متن کاملPolynomial time computable real functions
In this paper, we study computability and complexity of real functions. We extend these notions, already defined for functions over closed intervals or over the real line to functions over particular real open sets and give some results and characterizations, especially for polynomial time computable functions. Our representation of real numbers as sequences of rational numbers allows us to imp...
متن کاملComputable Real Functions : Type 1
Based on the Turing machine model there are essentially two diierent notions of computable functions over the real numbers. The eeective functions are deened only on computable real numbers and are Type 1 computable with respect to a numbering of the computable real numbers. The eeectively continuous functions may be deened on arbitrary real nunbers. They are exactly those functions which are T...
متن کاملComputable Functions of Bounded Variation and Semi-Computable Real Numbers
In this paper we discuss some basic properties of computable real functions which have bounded variations (CBV-functions for short). Especially, it is shown that the image set of semi-computable real numbers under CBV-functions is a proper subset of weakly computable real number class; Two applications of CBV-functions to semi-computable real numbers produce the whole closure of semi-computable...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00095-0